Fast computation of morphological operations with arbitrary structuring elements
نویسندگان
چکیده
منابع مشابه
Fast computation of morphological operations with arbitrary structuring elements
This paper presents a general algorithm that performs basic mathematical morphology operations, like erosions and openings, with any arbitrary shaped structuring element in an efficient way. It is shown that our algorithm has a lower or equal complexity but better computing time than all comparable known methods.
متن کاملMorphological Structuring Elements
For image processing systems that have a limited size of region of support, say 3 x 3, direct implementation of morphological operations by a structuring element larger than the prefixed size is impossible. The decomposition of morphological operations by a large structuring element into a sequence of recursive operations, each using a smaller structuring element, enables the implementation of ...
متن کاملParallel Decomposition of Generic Morphological Structuring Elements
The decomposition of a binary morphological structuring element is a well-known problem in pattern recognition that has often been addressed in the literature. Generally, only deterministic solutions have been considered, each relying on different assumptions. A different solution, with no such constraints, has been proposed by Anelli, Broggi and Destri: it is based on a stochastic evolutionary...
متن کاملAn Efficient Algorithm for 3d Binary Morphological Transformations with 3d Structuring Elements of Arbitrary Size and Shape
This paper proposes a fast algorithm for implementing the basic operation of Minkowski addition for the special case of binary three-dimensional images, using three-dimensional structuring elements of arbitrary size and shape. The application of the proposed algorithm for all the other morphological transformations is straightforward, as they can all be expressed in terms of Minkowski addition....
متن کاملDecomposition of Grey-Scale Morphological Structuring Elements in Hardware
AbstractMorphological image processing machines are not capable of handling large-size structuring elements. A new architecture for fast execution of the erosion/dilation operations in an up to 9× 9-pixel, arbitrarily shaped, image window through decomposition of grey-scale morphological structuring element into 3× 3-pixel sub-domains is presented in this paper. The proposed hardware structure ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pattern Recognition Letters
سال: 1996
ISSN: 0167-8655
DOI: 10.1016/s0167-8655(96)00113-4